| contributor | FMI, Theoretische Informatik |
| creator | Kufleitner, Manfred |
| date | 2006-02-07 |
| description | 17 pages |
| We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To this aim we give algebraic characterizations for the language operations of generating the polynomial closure and generating the unambiguous polynomial closure over traces. We also show that there exist natural fragments of local temporal logic that describe this class of languages corresponding to DA. All characterizations are known to hold for words. | |
| format | application/pdf |
| 176591 Bytes |
| identifier | http://www.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=TR-2006-03&engl=1 |
| language | eng |
| publisher | Stuttgart, Germany, Universität Stuttgart |
| relation | Technical Report No. 2006/03 |
| source | ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/TR-2006-03/TR-2006-03.pdf |
| subject | Mathematical Logic (CR F.4.1) |
| Formal Languages (CR F.4.3) | |
| Mazurkiewicz traces | |
| trace languages | |
| polynomial closure | |
| temporal logic | |
| title | Polynomials, Fragments of Temporal Logic and the Variety DA over Traces |
| type | Text |
| Technical Report |